Solving Large Problems Quickly : Progress in 1999
نویسندگان
چکیده
This document describes the progress we have made and the lessons we have learned in 1999 under the NASA Grant NAG2-1230 entitled \Application-Speci c Supercomputing". The long-term goal of this research is to accelerate large, irregular scienti c applications which have enormous data sets and which are di cult to parallelize. To accomplish this goal, we are exploring two complementary techniques: (i) using compilerinserted prefetching to automatically hide the I/O latency of accessing these large data sets from disk; and (ii) using thread-level data speculation to enable the optimistic parallelization of applications despite uncertainty as to whether data dependences exist between the resulting threads which would normally make them unsafe to execute in parallel. Overall, we made signi cant progress in 1999, and the project is going well. This research is supported by NASA Grant NAG2-1230.
منابع مشابه
A New Play-off Approach in League Championship Algorithm for Solving Large-Scale Support Vector Machine Problems
There are many numerous methods for solving large-scale problems in which some of them are very flexible and efficient in both linear and non-linear cases. League championship algorithm is such algorithm which may be used in the mentioned problems. In the current paper, a new play-off approach will be adapted on league championship algorithm for solving large-scale problems. The proposed algori...
متن کاملSolving infinite horizon optimal control problems of nonlinear interconnected large-scale dynamic systems via a Haar wavelet collocation scheme
We consider an approximation scheme using Haar wavelets for solving a class of infinite horizon optimal control problems (OCP's) of nonlinear interconnected large-scale dynamic systems. A computational method based on Haar wavelets in the time-domain is proposed for solving the optimal control problem. Haar wavelets integral operational matrix and direct collocation method are utilized to find ...
متن کاملA New Compromise Decision-making Model based on TOPSIS and VIKOR for Solving Multi-objective Large-scale Programming Problems with a Block Angular Structure under Uncertainty
This paper proposes a compromise model, based on a new method, to solve the multi-objective large-scale linear programming (MOLSLP) problems with block angular structure involving fuzzy parameters. The problem involves fuzzy parameters in the objective functions and constraints. In this compromise programming method, two concepts are considered simultaneously. First of them is that the optimal ...
متن کاملSearch in a Small World
In a graph with a small world topology nodes are highly clustered yet the path length be tween them is small Such a topology can make search problems very di cult since local deci sions quickly propagate globally We show that graphs associated with many di erent search problems have a small world topology and that the cost of solving such search problems can have a heavy tailed distribution The...
متن کاملInternational Conference on Case-Based Reasoning (ICCBR-99)
lem-solving paradigm that uses exemplars or previous solutions to solve new problems (Aamodt and Plaza 1994; Kolodner 1993). Three characteristics of CBR account for its growing popularity. First, CBR can reduce search. Solution reuse is compatible with a wide range of problem-solving methods, so a CBR component can be used in many types of problem-solving system. When similar problems recur, C...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000